- 01. Lesson Plan: Week 2
- 02. Course Introduction
- 03. Overview
- 04. The Minimax Algorithm
- 05. Isolation
- 06. Building a Game Tree
- 07. Coding: Building a Game Class
- 08. Which of These Are Valid Moves?
- 09. Coding: Game Class Functionality
- 10. Building a Game Tree (Contd.)
- 11. Isolation Game Tree with Leaf Values
- 12. How Do We Tell the Computer Not to Lose?
- 13. MIN and MAX Levels
- 14. Coding: Scoring Min & Max Levels
- 15. Propagating Values Up the Tree
- 16. Computing MIN MAX Values
- 17. Computing MIN MAX Solution
- 18. Choosing the Best Branch
- 19. Coding: Minimax Search
- 20. (DEPRECATED) Mini-Project: Coding Minimax
- 21. Searching Simple Games Reading
- 22. Lesson Plan: Week 3
- 23. Max Number of Nodes Visited
- 24. Max Moves
- 25. The Branching Factor
- 26. Number of Nodes in a Game Tree
- 27. The Branching Factor (Contd.)
- 28. Max Number of Nodes
- 29. Depth-Limited Search
- 30. Coding: Depth-Limited Minimax
- 31. Evaluation Function Intro
- 32. Testing the Evaluation Function
- 33. Testing the Evaluation Function Part 2
- 34. Testing Evaluation Functions
- 35. Testing the Evaluation Function Part 3
- 36. Quiescent Search